Exact worst-case response times of real-time tasks under fixed-priority scheduling with deferred preemption

نویسندگان

  • Reinder J. Bril
  • Wim F.J. Verhaegh
  • Johan J. Lukkien
چکیده

In this paper, we present equations to determine the exact worst-case response times of periodic tasks under fixedpriority scheduling with deferred preemption (FPDS) and arbitrary phasing. We show that the worst-case response time analysis is not uniform for all tasks. Our exact analysis is based on a dedicated conjecture for an ε-critical instant, and uses the notion of worst-case occupied time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existing worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption refuted

This paper revisits worst-case response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [3, 4, 5], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that ...

متن کامل

Existing worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption is too optimistic

This paper revisits response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [5, 6, 7], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that task when r...

متن کامل

Worst - case response time analysis of real - time tasks under fixed - priority scheduling with deferred preemption revisited – with extensions for ECRTS ’ 07 – ∗

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost of arbitrary preemptions. This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing...

متن کامل

Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost of arbitrary preemptions. This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing...

متن کامل

Analysis of hierarchical fixed-priority pre-emptive scheduling revisited

This paper revisits worst-case response time analysis of real-time tasks under hierarchical fixed-priority preemptive scheduling. Using an example consisting of a single server and a single hard real-time task, we show that existing worst-case response time analysis can be improved for deferrable servers and sporadic servers when a server is exclusively used for hard real-time tasks. Moreover, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004